Constacyclic codes of length $ 8p^s $ over $ \mathbb F_{p^m} + u\mathbb F_{p^m} $
نویسندگان
چکیده
منابع مشابه
Constacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Let p be an odd prime, s,m be positive integers and Fpm be the finite field with p m elements. In this paper, we determine all constacyclic codes of length 4p over the finite commutative chain ring R = Fpm + uFpm with unity, where u 2 = 0. We also determine their dual codes and list some isodual constacyclic codes of length 4p over R.
متن کاملConstacyclic codes of length $p^sn$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Let Fpm be a finite field of cardinality p m and R = Fpm[u]/〈u 〉 = Fpm +uFpm (u = 0), where p is a prime and m is a positive integer. For any λ ∈ Fpm, an explicit representation for all distinct λ-constacyclic codes over R of length pn is given by a canonical form decomposition for each code, where s and n are positive integers satisfying gcd(p, n) = 1. For any such code, using its canonical fo...
متن کاملAll $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$
Let Fpm be a finite field with cardinality p and R = Fpm + uFpm with u = 0. We aim to determine all α + uβ-constacyclic codes of length np over R, where α, β ∈ Fpm , n, s ∈ N+ and gcd(n, p) = 1. Let α0 ∈ F ∗ pm and α s 0 = α. The residue ring R[x]/〈x np − α − uβ〉 is a chain ring with the maximal ideal 〈x − α0〉 in the case that x n − α0 is irreducible in Fpm[x]. If x−α0 is reducible in Fpm[x], w...
متن کامل$(1+2u)$-constacyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$
Let $R=\mathbb{Z}_4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u^2=0$. In the present paper, we introduce a new Gray map from $R^n$ to $\mathbb{Z}_{4}^{2n}.$ We study $(1+2u)$-constacyclic codes over $R$ of odd lengths with the help of cyclic codes over $R$. It is proved that the Gray image of $(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic c...
متن کاملA family of constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ and application to quantum codes
We introduce a Gray map from F2m + uF2m to F 2m 2 and study (1 + u)-constacyclic codes over F2m + uF2m ,where u 2 = 0. It is proved that the image of a (1+u)-constacyclic code length n overF2m+uF2m under the Gray map is a distance-invariant quasi-cyclic code of indexm and length 2mn over F2. We also prove that every code of length 2mnwhich is the Gray image of cyclic codes overF2m+uF2m of lengt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2020
ISSN: 1930-5338
DOI: 10.3934/amc.2020123